On optimal heuristic randomized semidecision procedures, with application to proof complexity

The existence of a (p-)optimal propositional proof system is a major open question in (proof) complexity; many people conjecture that such systems do not exist. Krajicek and Pudlak (1989) show that this question is equivalent to the existence of an algorithm that is optimal on all propositional tautologies. Monroe (2009) recently gave a conjecture implying that such algorithm does not exist. We show that in the presence of errors such optimal algorithms do exist. The concept is motivated by the notion of heuristic algorithms. Namely, we allow the algorithm to claim a small number of false "theorems" (according to any samplable distribution on non-tautologies) and err with bounded probability on other inputs. Our result can also be viewed as the existence of an optimal proof system in a class of proof systems obtained by generalizing automatizable proof systems.Comment: 11 pages, accepted to STACS 201

Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT

AbstractThe maximum 2-satisfiability problem (MAX-2-SAT) is: given a Boolean formula in 2-CNF, find a truth assignment that satisfies the maximum possible number of its clauses. MAX-2-SAT is MAX-SNP-complete. Recently, this problem received much attention in the contexts of (polynomial-time) approximation algorithms and (exponential-time) exact algorithms. In this paper, we present an exact algorithm solving MAX-2-SAT in time poly(L)·2K/5, where K is the number of clauses and L is their total length. In fact, the running time is only poly(L)·2K2/5, where K2 is the number of clauses containing two literals. This bound implies the bound poly(L)·2L/10. Our results significantly improve previous bounds: poly(L)·2K/2.88 (J. Algorithms 36 (2000) 62–88) and poly(L)·2K/3.44 (implicit in Bansal and Raman (Proceedings of the 10th Annual Conference on Algorithms and Computation, ISAAC’99, Lecture Notes in Computer Science, Vol. 1741, Springer, Berlin, 1999, pp. 247–258.))As an application, we derive upper bounds for the (MAX-SNP-complete) maximum cut problem (MAX-CUT), showing that it can be solved in time poly(M)·2M/3, where M is the number of edges in the graph. This is of special interest for graphs with low vertex degree

On the Limits of Gate Elimination

Although a simple counting argument shows the existence of Boolean functions of exponential circuit complexity, proving superlinear circuit lower bounds for explicit functions seems to be out of reach of the current techniques. There has been a (very slow) progress in proving linear lower bounds with the latest record of 3 1/86*n-o(n). All known lower bounds are based on the so-called gate elimination technique. A typical gate elimination argument shows that it is possible to eliminate several gates from an optimal circuit by making one or several substitutions to the input variables and repeats this inductively. In this note we prove that this method cannot achieve linear bounds of cn beyond a certain constant c, where c depends only on the number of substitutions made at a single step of the induction

Mobile telephony for community networking and civic engagement in an immigrant community

Thesis (S.M.)--Massachusetts Institute of Technology, School of Architecture and Planning, Program in Media Arts and Sciences, 2004.Includes bibliographical references (leaves 76-81).Immigrants face a variety of barriers limiting their access to social services. These include inability to speak English, unfamiliarity with available services, and distrust of government agencies. To overcome these obstacles, many immigrants rely on informal social networks for information, advice, and language interpretation. This is an imperfect solution that provides inadequate access for the immigrant and unduly burdens friends and family members. More importantly, it does little to address the social isolation that characterizes much of the immigrant experience and contributes to the disenfranchisement of immigrant communities. Speakeasy is a community-based service that provides telephone-based access to a network of volunteers who provide real-time language interpretation and help navigate complex social service networks. Relying on the constant connectivity afforded by cell phones and wireless devices, Speakeasy overcomes barriers to traditional forms of volunteerism with a "just in time" model of community service. The system also encourages community development efforts by engaging new immigrants and volunteers in community activity, and by fostering a sense of collective identity. A study with members of Boston's Chinatown community showed that Speakeasy is an effective, convenient, and easy to use service that engenders trust among non-English speakers.by Edward A. Hirsch.S.M

Innovation for political activism

Thesis (Ph. D.)--Massachusetts Institute of Technology, School of Architecture and Planning, Program in Media Arts and Sciences, 2008.Includes bibliographical references (leaves 134-142).This thesis presents contestational design, a unique form of design activity whose aim is promote particular agendas in contested political arenas. I propose a framework for analyzing contestational design processes, which I then apply to two initiatives that developed communications infrastructure for activist groups. The first case study is TXTmob, an SMS-broadcast system that I developed with an ad-hoc coalition of activists to support mass mobilizations during the 2004 Democratic and Republican National Conventions. It has been used by thousands of people and has inspired new projects in both the nonprofit and commercial sectors. The second case study is Dialup Radio, a telephone-based independent media system that I developed with a civil society organization in Zimbabwe. It was intended to disseminate activist information, particularly to Zimbabwe's rural poor. Despite limited infrastructure and government restrictions, several prototypes were produced and tested in Zimbabwe. After describing each case study individually, I turn to a comparison of their respective processes and the artifacts that each produced. Examining the cases side by side, I identify a set of common issues with which contestational designers contend at various points in the design process. Finally, I describe a set of organizing principles that distinguish contestational design from other kinds of design activity.Tad Hirsch.Ph.D

Differential analysis for high density tiling microarray data

Background: High density oligonucleotide tiling arrays are an effective and powerful platform for conducting unbiased genome-wide studies. The ab initio probe selection method employed in tiling arrays is unbiased, and thus ensures consistent sampling across coding and non-coding regions of the genome. These arrays are being increasingly used to study the associated processes of transcription, transcription factor binding, chromatin structure and their association. Studies of differential expression and/or regulation provide critical insight into the mechanics of transcription and regulation that occurs during the developmental program of a cell. The time-course experiment, which comprises an in-vivo system and the proposed analyses, is used to determine if annotated and un-annotated portions of genome manifest coordinated differential response to the induced developmental program. Results: We have proposed a novel approach, based on a piece-wise function – to analyze genome-wide differential response. This enables segmentation of the response based on protein-coding and non-coding regions; for genes the methodology also partitions differential response with a 5' versus 3' versus intra-genic bias. Conclusion: The algorithm built upon the framework of Significance Analysis of Microarrays, uses a generalized logic to define regions/patterns of coordinated differential change. By not adhering to the gene-centric paradigm, discordant differential expression patterns between exons and introns have been identified at a FDR of less than 12 percent. A co-localization of differential binding between RNA Polymerase II and tetra-acetylated histone has been quantified at a p-value < 0.003 it is most significant at the 5' end of genes, at a p-value < 10^{-13}. The prototype R code has been made available as supplementary material [see Additional file 1]

Analysis of Neptune's 2017 Bright Equatorial Storm

We report the discovery of a large ($\sim$8500 km diameter) infrared-bright storm at Neptune's equator in June 2017. We tracked the storm over a period of 7 months with high-cadence infrared snapshot imaging, carried out on 14 nights at the 10 meter Keck II telescope and 17 nights at the Shane 120 inch reflector at Lick Observatory. The cloud feature was larger and more persistent than any equatorial clouds seen before on Neptune, remaining intermittently active from at least 10 June to 31 December 2017. Our Keck and Lick observations were augmented by very high-cadence images from the amateur community, which permitted the determination of accurate drift rates for the cloud feature. Its zonal drift speed was variable from 10 June to at least 25 July, but remained a constant $237.4 \pm 0.2$ m s$^{-1}$ from 30 September until at least 15 November. The pressure of the cloud top was determined from radiative transfer calculations to be 0.3-0.6 bar; this value remained constant over the course of the observations. Multiple cloud break-up events, in which a bright cloud band wrapped around Neptune's equator, were observed over the course of our observations. No "dark spot" vortices were seen near the equator in HST imaging on 6 and 7 October. The size and pressure of the storm are consistent with moist convection or a planetary-scale wave as the energy source of convective upwelling, but more modeling is required to determine the driver of this equatorial disturbance as well as the triggers for and dynamics of the observed cloud break-up events.Comment: 42 pages, 14 figures, 6 tables; Accepted to Icaru

Novel insights into the cardio-protective effects of FGF21 in lean and obese rat hearts

Aims: Fibroblast growth factor 21 (FGF21) is a hepatic metabolic regulator with pleotropic actions. Its plasma concentrations are increased in obesity and diabetes; states associated with an increased incidence of cardiovascular disease. We therefore investigated the direct effect of FGF21 on cardio-protection in obese and lean hearts in response to ischemia. Methods and Results: FGF21, FGF21-receptor 1 (FGFR1) and beta-Klotho (βKlotho) were expressed in rodent, human hearts and primary rat cardiomyocytes. Cardiac FGF21 was expressed and secreted (real time RT-PCR/western blot and ELISA) in an autocrine-paracrine manner, in response to obesity and hypoxia, involving FGFR1-βKlotho components. Cardiac-FGF21 expression and secretion were increased in response to global ischemia. In contrast βKlotho was reduced in obese hearts. In isolated adult rat cardiomyocytes, FGF21 activated PI3K/Akt (phosphatidylinositol 3-kinase/Akt), ERK1/2(extracellular signal-regulated kinase) and AMPK (AMP-activated protein kinase) pathways. In Langendorff perfused rat [adult male wild-type wistar] hearts, FGF21 administration induced significant cardio-protection and restoration of function following global ischemia. Inhibition of PI3K/Akt, AMPK, ERK1/2 and ROR-α (retinoic-acid receptor alpha) pathway led to significant decrease of FGF21 induced cardio-protection and restoration of cardiac function in response to global ischemia. More importantly, this cardio-protective response induced by FGF21 was reduced in obesity, although the cardiac expression profiles and circulating FGF21 levels were increased. Conclusion: In an ex vivo Langendorff system, we show that FGF21 induced cardiac protection and restoration of cardiac function involving autocrine-paracrine pathways, with reduced effect in obesity. Collectively, our findings provide novel insights into FGF21-induced cardiac effects in obesity and ischemia

FGFR3 expression in primary and metastatic urothelial carcinoma of the bladder

While fibroblast growth factor receptor 3 (FGFR3) is frequently mutated or overexpressed in nonmuscle-invasive urothelial carcinoma (UC), the prevalence of FGFR3 protein expression and mutation remains unknown in muscle-invasive disease. FGFR3 protein and mRNA expression, mutational status, and copy number variation were retrospectively analyzed in 231 patients with formalin-fixed paraffin-embedded primary UCs, 33 metastases, and 14 paired primary and metastatic tumors using the following methods: immunohistochemistry, NanoString nCounterTM, OncoMap or Affymetrix OncoScanTM array, and Gain and Loss of Analysis of DNA and Genomic Identification of Significant Targets in Cancer software. FGFR3 immunohistochemistry staining was present in 29% of primary UCs and 49% of metastases and did not impact overall survival (P = 0.89, primary tumors; P = 0.78, metastases). FGFR3 mutations were observed in 2% of primary tumors and 9% of metastases. Mutant tumors expressed higher levels of FGFR3 mRNA than wild-type tumors (P < 0.001). FGFR3 copy number gain and loss were rare events in primary and metastatic tumors (0.8% each; 3.0% and 12.3%, respectively). FGFR3 immunohistochemistry staining is present in one third of primary muscle-invasive UCs and half of metastases, while FGFR3 mutations and copy number changes are relatively uncommon